Continuous-space model of computation is Turing universal
نویسنده
چکیده
Our model of computation (theoretical machine) was designed for the analysis of analog Fourier optical processors, its basic data unit being a continuous image of unbounded resolution. In this paper, we demonstrate the universality of our machine by presenting a framework for arbitrary Turing machine simulation. Computational complexity bene ts are also demonstrated by providing a O(log2n) algorithm for a search problem that has a lower bound of n 1 on a Turing machine.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملDynamic Turing Machine: model and properties for runtime code changes
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. This model is capable of applying runtime code modifications for 3-symbol deterministic Turing Machines at runtime and requires a decomposition of the simulated machine into parts called subtasks. The algorithm for performing runtime changes is considered, and the ability to apply runtime changes is...
متن کاملConsequences of nonclassical measurement for the algorithmic description of continuous dynamical systems
Absrrucr: Continuous dynamical systems intuitively seem capable of more complex behavior than discrete systems. If analyzed in the framework of the traditional theory of computation, a continuous dynamical system with countablely many quasistable states has at least the computational power of a universal Turing machine. Such an analysis assumes, however, the classical notion of measurement. If ...
متن کاملUniversal computation is 'almost surely' chaotic
Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard notions of a chaotic system is not readily applicable for them. Changing the state space of Turing Machines from integer to rational space, the condition for chao...
متن کاملOn the Computational Power of a Continuous-Space Optical Model of Computation
Our continuous-space model of computation was developed for the analysis of analog optical computing architectures and algorithms. We show a lower bound on the computational power of this model by Type-2 machine simulation. We view each Type-2 computation as a sequence of repeated instantiations of a single halting Turing machine. We also illustrate, by example, a problem solvable with our mode...
متن کامل